Four Rules of Inference for Ranking Argumentation

نویسنده

  • Bruce P. Hayes
چکیده

I think any scholar working in Optimality Theory (Prince and Smolensky 1993, and much subsequent work) would agree that rigorous language-particular analysis within this framework should provide solid arguments for the ranking of constraints. It is sometimes underappreciated just what is involved in developing such arguments. I will suggest that arguments from ordinary human reasoning are (probably) not generally as reliable as arguments produced by algorithm. A sample algorithm of the appropriate type, which uses four rules of inference, is laid out here. I also suggest that algorithmic ranking argumentation has some potential theoretical as well as practical consequences.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Are Ranking Semantics Sensitive to the Notion of Core?

In this paper, we study the impact of two notions of core on the output of ranking semantics in logical argumentation frameworks. We consider the existential rules fragment, a language widely used in Semantic Web and Ontology Based Data Access applications. Using burden semantics as example we show how some ranking semantics yield different outputs on the argumentation graph and its cores. We e...

متن کامل

No More than Necessary Beyond the ‘ Four Rules ’ , and a Bug Report

After proposing four ‘rules of inference’ to be used in the program OTSoft for simplifying collections of ranking arguments, Hayes 1997 implicitly raises the question of whether these rules suffice. In this note, the simplification goal is spelled out within the analytical framework of Prince 2002a and Brasoveanu & Prince 2005, in prep. and the question is settled (negatively). A broader genera...

متن کامل

Two Aspects of Relevance in Structured Argumentation: Minimality and Paraconsistency

This paper studies two issues concerning relevance in structured argumentation in the context of the ASPIC framework, arising from the combined use of strict and defeasible inference rules. One issue arises if the strict inference rules correspond to classical logic. A longstanding problem is how the trivialising effect of the classical Ex Falso principle can be avoided while satisfying consist...

متن کامل

An abstract framework for argumentation with structured arguments

An abstract framework for structured arguments is presented that instantiates Dung’s (1995) abstract argumentation frameworks. Arguments are defined as inference trees formed by applying two kinds of inference rules: strict and defeasible rules. This naturally leads to three ways of attacking an argument: attacking a premise, attacking a conclusion and attacking an inference. To resolve such at...

متن کامل

Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights

Recently, a temporal extension of the argumentation defeasible reasoning system DeLP has been proposed. This system, called t-DeLP, allows to reason defeasibly about changes and persistence over time but does not offer the possibility of ranking defeasible rules according to criteria of preference or certainty (in the sense of belief). In this contribution we extend t-DeLP by allowing to attach...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003